Asymptotic analysis in multivariate average case approximation with Gaussian kernels
نویسندگان
چکیده
We consider tensor product random fields Yd, d∈N, whose covariance functions are Gaussian kernels with a given sequence of length scale parameters. investigate the growth average case approximation complexity nYd(ε) Yd for arbitrary fixed ε∈(0,1) and d→∞. Namely, we find criteria boundedness depending on d nYd(ε)→∞ when d→∞ any ε∈(0,1). In latter obtain necessary sufficient conditions following logarithmic asymptoticslnnYd(ε)=ad+q(ε)bd+o(bd),d→∞, Here q:(0,1)→R is non-decreasing function, (ad)d∈N (bd)d∈N positive such that bd→∞, show only special quantiles self-decomposable distribution appear as q in asymptotics. These general results apply to under particular assumptions
منابع مشابه
Average Case Approximation: Convergence and Tractability of Gaussian Kernels
We study the problem of approximating functions of d variables in the average case setting for a separable Banach space Fd equipped with a zero-mean Gaussian measure. The covariance kernel of this Gaussian measure takes the form of a Gaussian that depends on shape parameters γl. We stress that d can be arbitrarily large. Our approximation error is defined in the L2 norm, and we study the minima...
متن کاملNonlinear Approximation Using Gaussian Kernels
It is well-known that non-linear approximation has an advantage over linear schemes in the sense that it provides comparable approximation rates to those of the linear schemes, but to a larger class of approximands. This was established for spline approximations and for wavelet approximations, and more recently for homogeneous radial basis function (surface spline) approximations. However, no s...
متن کاملMultivariate online kernel density estimation with Gaussian kernels
We propose a novel approach to online estimation of probability density functions, which is based on kernel density estimation (KDE). The method maintains and updates a non-parametric model of the observed data, from which the KDE can be calculated. We propose an online bandwidth estimation approach and a compression/revitalization scheme which maintains the KDE’s complexity low. We compare the...
متن کاملGeodesic Gaussian kernels for value function approximation
The least-squares policy iteration approach works efficiently in value function approximation, given appropriate basis functions. Because of its smoothness, the Gaussian kernel is a popular and useful choice as a basis function. However, it does not allow for discontinuity which typically arises in real-world reinforcement learning tasks. In this paper, we propose a new basis function based on ...
متن کاملIntegration and Approximation of Multivariate Functions: Average Case Complexity with Isotropic Wiener Measure
We study the average case complexity of multivariate integration and L2 function approximation for the class F = C([0, 1]) of continuous functions of d variables. The class F is endowed with the isotropic Wiener measure (Brownian motion in Levy’s sense). Furthermore, for both problems, only function values are used as data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2022
ISSN: ['1090-2708', '0885-064X']
DOI: https://doi.org/10.1016/j.jco.2021.101631